A QR algorithm with variable iteration multiplicity
نویسندگان
چکیده
منابع مشابه
A rational QR-iteration
In this manuscript a new type of QR-iteration will be presented. Each step of this new iteration consists of two substeps. In the explicit version, first an RQ-factorization of the initial matrix A−κI = RQ will be computed, followed by a QR-factorization of the matrix (A−σI)QH . Applying the unitary similarity transformation defined by the QR-factorization of the transformed matrix (A−σI)QH , w...
متن کاملQuadratic Newton Iteration for Systems with Multiplicity
Newton’s iterator is one of the most popular components of polynomial equation system solvers, either from the numeric or symbolic point of view. This iterator usually handles smooth situations only (when the Jacobian matrix associated to the system is invertible). This is often a restrictive factor. Generalizing Newton’s iterator is still an open problem: How to design an efficient iterator wi...
متن کاملThe Periodic QR Algorithm is a Disguised QR Algorithm
Abstract The periodic QR algorithm is a strongly backward stable method for computing the eigenvalues of products of matrices, or equivalently for computing the eigenvalues of block cyclic matrices. The main purpose of this paper is to show that this algorithm is numerically equivalent to the standard QR algorithm. It will be demonstrated how this connection may be used to develop a better unde...
متن کاملThe QR iteration method for quasiseparable matrices
Let {ak}, k = 1, . . . , N be a family of matrices of sizes rk × rk−1. For positive integers i, j, i > j define the operation aij as follows: a × ij = ai−1 · · ·aj+1 for i > j + 1, aj+1,j = Irj . Let {bk}, k = 1, . . . , N be a family of matrices of sizes rk−1 × rk. For positive integers i, j, j > i define the operation bij as follows: b × ij = bi+1 · · · bj−1 for j > i+ 1, bi,i+1 = Iri . It is...
متن کاملSymmetric QR Algorithm with Permutations
In this paper, we present the QR Algorithm with Permutations that shows an improved convergence rate compared to the classical QR algorithm. We determine a bound for performance based on best instantaneous convergence, and develop low complexity methods for computing the permutation matrices at every iteration. We use simulations to verify the improvement, and to compare the performance of prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1997
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(97)00151-9